Enumerating ODE Equivalent Homogeneous Networks

نویسنده

  • Alistair J. Windsor
چکیده

We give an alternative criterion for ODE equivalence in identical edge homogeneous coupled cell networks. This allows us to give a simple proof of Theorem 10.3 of Aquiar and Dias, which characterizes minimal identical edge homogeneous coupled cell networks. Using our criterion we give a formula for counting homogeneous coupled cell networks up to ODE equivalence. Our criterion is purely graph theoretic and makes no explicit use of linear algebra.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal coupled cell networks

It is known that non-isomorphic coupled cell networks can have equivalent dynamics. Such networks are said to be ODE-equivalent and are related by a linear algebra condition involving their graph adjacency matrices. A network in an ODE-equivalence class is said to be minimal if it has a minimum number of edges. When studying a given network in an ODE-class it can be of great value to study inst...

متن کامل

Linear Equivalence and ODE-equivalence for Coupled Cell Networks

Coupled cell systems are systems of ODEs, defined by ‘admissible’ vector fields, associated with a network whose nodes represent variables and whose edges specify couplings between nodes. It is known that non-isomorphic networks can correspond to the same space of admissible vector fields. Such networks are said to be ‘ODE-equivalent’. We prove that two networks are ODE-equivalent if and only i...

متن کامل

Computational Analysis of Network ODE Systems in Metric Spaces: An Approach

Email: [email protected] Abstract: Traditionally, the concepts of graph theory are applied to design stationary computer networks and, to analyze dynamics of social networks. However, the majority of non-stationary network models are formulated by using Ordinary Differential Equations (ODE) with varying orders having homogeneous or non-homogeneous forms. However, the analysis of continuous ...

متن کامل

Tipping Points of Diehards in Social Consensus on Large Random Networks

We introduce the homogeneous pair approximation to the Naming Game (NG) model, establish a six dimensional ODE for the two-word NG. Our ODE reveals how the dynamical behavior of the NG changes with respect to the average degree < k > of an uncorrelated network and shows a good agreement with the numerical results. We also extend the model to the committed agent case and show the shift of the ti...

متن کامل

Analytic Treatment of Tipping Points for Social Consensus in Large Random Networks

We introduce a homogeneous pair approximation to the naming game (NG) model by deriving a six-dimensional Open Dynamics Engine (ODE) for the two-word naming game. Our ODE reveals the change in dynamical behavior of the naming game as a function of the average degree {k} of an uncorrelated network. This result is in good agreement with the numerical results. We also analyze the extended NG model...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1105.4812  شماره 

صفحات  -

تاریخ انتشار 2011